Block Intersection Numbers of Block Designs Ii

نویسندگان

  • MITSUO YOSHIZAWA
  • M. YOSHIZAWA
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi-symmetric 3-designs with a fixed block intersection number

Quasi-symmetric 3-designs with block intersection numbers x, y (0 ≤ x ≤ y < k) are studied. It is proved that the parameter λ of a quasi-symmetric 3-(v, k, λ) design satisfies a quadratic whose coefficients are polynomial functions of k, x and y. We use this quadratic to prove that there exist finitely many quasi-symmetric 3-designs under either of the following two restrictions: 1. The block i...

متن کامل

Construction of a Class of Quasi-Symmetric 2-Designs

In this article we study proper quasi-symmetric 2 − designs i.e. block designs having two intersection numbers and , where 0 < < . Also, we present a construction method for quasi-symmetric 2 − designs with block intersection numbers and + 1, where is a prime number, under certain conditions on the cardinality of point set.

متن کامل

More on block intersection polynomials and new applications to graphs and block designs

The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy certain integer linear equations involving binomial coefficients, and information on the nonnegative integer solutions to these equations can be obtained using the block intersection polynomials introduced by P.J. Came...

متن کامل

On the structure of 1-designs with at most two block intersection numbers

We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of blocks into other 1-designs. We discover an infinite family of 1-designs with at most two block intersection numbers that each have a unique unrefinable decomposition, and we give a polynomial-time algorithm to compute...

متن کامل

Most Robust BIBDs

Intense combinatorial study of balanced incomplete block designs since the time of Fisher and Yates has led to a great many designs with the same numbers of treatments, blocks, and block size. While the basic analysis does not differentiate among different BIBDs with the same parameters, they do differ in their capacity to withstand loss of experimental material. Competing BIBDs are compared he...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016